Exploring conditional rewriting logic computations

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dynamic Backward Slicing of Rewriting Logic Computations

Trace slicing is a widely used technique for execution trace analysis that is effectively used in program debugging, analysis and comprehension. In this paper, we present a backward trace slicing technique that can be used for the analysis of Rewriting Logic theories. Our trace slicing technique allows us to systematically trace back rewrite sequences modulo equational axioms (such as associati...

متن کامل

Parametric Exploration of Rewriting Logic Computations

This paper presents a parameterized technique for the inspection of Rewriting Logic computations that allows the non-deterministic execution of a given rewrite theory to be followed up in different ways. Starting from a selected state in the computation tree, the exploration is driven by a user-defined, inspection criterion that specifies the exploration mode. By selecting different inspection ...

متن کامل

Concurrent Re Blockinective Computations in Rewriting Logic

Rewriting logic can represent dynamic behaviors of concurrent and/or reactive systems declaratively. Declarative descriptions in rewriting logic are expected to be amenable to analysis of interesting properties. The group-wide architecture based on the actor model is a speci c concurrent re ective computation model based on \group-wide re ection". It has a potential of modeling cooperative beha...

متن کامل

Translating Logic Programs into Conditional Rewriting Systems

In this paper a translation from a subclass of logic programs consisting of the simply moded logic programs into rewriting systems is deened. In these rewriting systems conditions and explicit substitutions may be present. We argue that our translation is more natural than previously studied ones and establish a result showing its correctness. programming: transforming logic programs to lazy fu...

متن کامل

An Example for Concurrent Re ective Computations in Rewriting Logic

Rewriting logic can represent dynamic behaviors of concurrent and/or reactive systems declaratively. Declarative descriptions in rewriting logic are expected to be amenable to analysis of interesting properties. The group-wide architecture based on the actor model is a speci c concurrent re ective computation model based on "group-wide re ection". It has a potential of modeling cooperative beha...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Symbolic Computation

سال: 2015

ISSN: 0747-7171

DOI: 10.1016/j.jsc.2014.09.028